Worst-case efficient dominating sets in digraphs
نویسندگان
چکیده
منابع مشابه
Worst-case efficient dominating sets in digraphs
Let 1 ≤ n ∈ Z. Worst-case efficient dominating sets in digraphs are conceived so that their presence in certain strong digraphs ~ STn corresponds to that of efficient dominating sets in star graphs STn: The fact that the star graphs STn form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs ~ STn. Related chains of graphs and open problems are ...
متن کاملEfficient dominating sets in Cayley graphs
An independent set C of vertices in a graph is an efficient dominating set (or perfect code) when each vertex not in C is adjacent to exactly one vertex in C. An E-chain is a countable family of nested graphs, each of which has an efficient dominating set. The Hamming codes in the n-cubes provide a classical example of E-chains. We give a constructing tool to produce E-chains of Cayley graphs. ...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملWorst Case Efficient Data Structures
We study the design of efficient data structures. In particular we focus on the design of data structures where each operation has a worst case efficient implementations. The concrete problems we consider are partial persistence, implementation of priority queues, and implementation of dictionaries. The first problem we consider is how to make bounded in-degree and out-degree data structures pa...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.11.016